Hybrid VNS-TS heuristics for University Course Timetabling Problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Approach for University Course Timetabling
The university course timetabling problem deals with the assignment of lectures to specific timeslots and rooms. The goal is to satisfy the soft constraints to the largest degree possible while constructing a feasible schedule. In this paper, we present a hybrid approach consisting of three phases. During phase 1, initial solutions are generated using a constructive heuristic. An improvement ap...
متن کاملA hybrid metaheuristic approach to the university course timetabling problem
This paper describes the development of a novel metaheuristic that combines an electromagnetic-like mechanism (EM) and the great deluge algorithm (GD) for the University course timetabling problem. This well-known timetabling problem assigns lectures to specific numbers of timeslots and rooms maximizing the overall quality of the timetable while taking various constraints into account. EM is a ...
متن کاملHybridizing Meta-heuristics Approaches for Solving University Course Timetabling Problems
In this paper we have presented a combination of two metaheuristics, namely great deluge and tabu search, for solving the university course timetabling problem. This problem occurs during the assignment of a set of courses to specific timeslots and rooms within a working week and subject to a variety of hard and soft constraints. Essentially a set of hard constraints must be satisfied in order ...
متن کاملEffective learning hyper-heuristics for the course timetabling problem
Course timetabling is an important and recurring administrative activity in most educational institutions. This article combines a general modeling methodology with effective learning hyper-heuristics to solve this problem. The proposed hyper-heuristics are based on an iterated local search procedure that autonomously combines a set of move operators. Two types of learning for operator selectio...
متن کاملuniversity course timetabling using graph-based hyper heuristics
university course timetabling is a complex optimizationproblem. there are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. eachcomponent enforces a set of normally conflicting constraints on thesolution space. the problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Brazilian Journal of Operations & Production Management
سال: 2020
ISSN: 2237-8960,1679-8171
DOI: 10.14488/bjopm.2020.014